The Reconstruction of Polyominoes from Horizontal and Vertical Projections and Morphological Skeleton is NP-complete
نویسندگان
چکیده
Reconstruction of binary images from their projections is one of the main tasks in many image processing areas, therefore determining the computational complexity of those problems is essential. The reconstruction complexity is highly dependent on the requirements of the image. In this paper, we will show that the reconstruction is NP-complete if the horizontal and vertical projections and the morphological skeleton of the image are given, and it is supposed that the image is 4-connected.
منابع مشابه
Reconstruction of convex polyominoes from orthogonal projections of their contours
The problem of reconstructing a convex polyominoes from its horizontal and vertical projections when the projections are defined as the number of cells of the polyomino in the different lines and columns was studied by Del Lungo and M. Nivat (cf [7]). In this paper we study the reconstruction of any convex polyomino when the orthogonal projections are defined as the contour length of the object...
متن کاملThe Reconstruction of Convex Polyominoes from Horizontal and Vertical Projections
The problem of reconstructing a discrete set from its horizontal and vertical projections (RSP) is of primary importance in many different problems for example pattern recognition, image processing and data compression. We give a new algorithm which provides a reconstruction of convex polyominoes from horizontal and vertical projections. It costs atmost O(min(m, n) · mn log mn) for a matrix tha...
متن کاملThe Reconstruction of Polyominoes from Approximately Orthogonal Projections
The reconstruction of discrete two-dimensional pictures from their projection is one of the central problems in the areas of medical diagnostics, computer-aided tomography, pattern recognition, image processing, and data compression. In this note, we determine the computational complexity of the problem of reconstruction of polyominoes from their approximately orthogonal projections. We will pr...
متن کاملTomographical aspects of L-convex polyominoes
Our main purpose is to characterize the class of L-convex polyominoes introduced in [3] by means of their horizontal and vertical projections. The achieved results allow an answer to one of the most relevant questions in tomography i.e. the uniqueness of discrete sets, with respect to their horizontal and vertical projections. In this paper, by giving a characterization of L-convex polyominoes,...
متن کاملReconstructing Convex Polyominoes from Horizontal and Vertical Projections
Reconstructing discrete bidimensional sets from their projections is involved in many different problems of computer-aided tomography, pattern recognition, image processing and data compression. In this paper, we examine the problem of reconstructing a discrete bidimensional set S satisfying some convexity conditions from its two orthogonal projections (H, v). We develop an algorithm that start...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 125 شماره
صفحات -
تاریخ انتشار 2013